Soft Matching for Question Answering
نویسنده
چکیده
Soft Matching for Question Answering
منابع مشابه
Using Generalized Language Model for Question Matching
Question and answering service is one of the popular services in the World Wide Web. The main goal of these services is to finding the best answer for user's input question as quick as possible. In order to achieve this aim, most of these use new techniques foe question matching. . We have a lot of question and answering services in Persian web, so it seems that developing a question matching m...
متن کاملInvestigating Embedded Question Reuse in Question Answering
The investigation presented in this paper is a novel method in question answering (QA) that enables a QA system to gain performance through reuse of information in the answer to one question to answer another related question. Our analysis shows that a pair of question in a general open domain QA can have embedding relation through their mentions of noun phrase expressions. We present methods f...
متن کاملA Comparative Study on Sentence Retrieval for Definitional Question Answering
Most definitional question answering (QA) systems integrate statistical ranking using Web and WordNet as external resources and pattern matching to retrieve relevant sentences for further processing. We examine the impact of using these two common resources in answering definition questions by varying the use of WordNet and two types of Web resources in statistical ranking, and definition patte...
متن کاملNatural Language Supported Relation Matching for Question Answering with Knowledge Graphs
This work focuses on the relation matching problem in knowledge based question answering systems. Finding the right relation a natural question asks is a key step in current knowledge based question answering systems, while also being the most difficult one, because of the mismatch between natural language question and formal relation type definitions. In this paper, we present two approaches t...
متن کاملApplying Structural Matching and Paraphrasing
We discuss the potentialities of structural matching as a compromise between fully-conceptual deep processing approaches and shallow bag-of-words approaches to answer seeking. We extended Collins's Tree Kernel [1] to formulate a new algorithm for soft structural matching, and we also developed and tested a method for combing structural matching with paraphrasing. Unfortunately, we found no posi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006